Elements of finite order for finite monadic Church-Rosser Thue systems
نویسندگان
چکیده
منابع مشابه
Elements of Finite Order for Finite Monadic Church-rosser True Systems
A Thue system T over ~ is said to allow nontrivial elements of finite order, if there exist a word u E ~* and integers n ;;. 0 and k ;;. 1 such that u .... fA and u,,+k .... f u". Here the following decision problem is shown to be decidable: Instance. A finite, monadic, Church-Rosser Thue system Tover~. Question. Does T allow nontrivial elements of finite order? By a result of Muller and Schupp...
متن کاملThe Church-Rosser Property and Special Thue Systems
In an earlier paper we gave an O([ TI s) algorithm for testing the Church-Rosser property of Thue systems, where I TI is the total size of the Thue system. Here we improve that bound to O(klTI), where k is the number of rules in T, in the case when the Thue system is special, i.e., when all its rules are of the form (x, A) where A is the empty string. Also obtained are several results on specia...
متن کاملA Characterization of Weakly Church-Rosser Abstract Reduction Systems That Are Not Church-Rosser
reduction systems (ARS) are abstract structures for studying general properties of rewriting systems. An ARS is just a set equipped with a set of binary relations. Despite this generality many aspects of rewriting systems can be approached in the theory of ARS, such as confluence and normalization. Moreover, important results have been stated and proved in this setting (examples are Newman’s le...
متن کاملFinite Time Mix Synchronization of Delay Fractional-Order Chaotic Systems
Chaos synchronization of coupled fractional order differential equation is receiving increasing attention because of its potential applications in secure communications and control processing. The aim of this paper is synchronization between two identical or different delay fractional-order chaotic systems in finite time. At first, the predictor-corrector method is used to obtain the solutions ...
متن کاملChurch-Rosser Made Easy
The Church–Rosser theorem states that the λ-calculus is confluent under αand β-reductions. The standard proof of this result is due to Tait and Martin-Löf. In this note, we present an alternative proof based on the notion of acceptable orderings. The technique is easily modified to give confluence of the βη-calculus.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1985
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1985-0800255-1